Digital signature and public key cryptosystems in a prime order subgroup of Zn*
نویسنده
چکیده
A new digital signature scheme and public key cryptosystem are proposed which use operations in a prime order subgroup of Z n for a composite number n. There are similarities with the best known digital signatures and public key cryptosystems (RSA and discrete logarithm based schemes) in terms of the mathematical structure. With regard to computational requirements the new schemes are competitive and, in particular, are more eecient than the best known schemes when averaged over both public and private key computations.
منابع مشابه
A Novel Modular Multiplication Algorithm and its Application to RSA Decryption
The services such as electronic commerce, internet privacy, authentication, confidentiality, data integrity and non repudiation are presented by public key cryptosystems. The most popular of public key cryptosystems is RSA cryptosystem. RSA is widely used for digital signature and digital envelope, which provide privacy and authentication. The basic operation of RSA cryptosystem is modular expo...
متن کاملElliptic curve cryptographic systems
Remark 3 To resist generic attacks on the discrete logarithm problem, elliptic curve cryptosystems are implemented in the prime order cyclic subgroup of maximal cardinality n inside E(Fq). For representing group elements with the minimum number of bits, it is desirable that the curve order itself be prime. Except for special cases (see Section 1.3 and [59, 61, 65]), only generic attacks are kno...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملSecure and Fast Digital Signatures using BCH Codes
Since the introduction of public key cryptography in the 70’s [1], many cryptosystems have been proposed and many cryptographic schemes have been broken. The most used cryptosystems rely on number theory problem like the factorization problem [3] and the discrete logarithm over suitable group [2]. The McEliece cryptosystem [5] and the Neiderreiter variante [6] rely on coding theory, they are on...
متن کاملA Secure Electronic Payment System Based on Efficient Public Key Infrastructure
At present, electronic payment activities constructed on the Internet mainly employ the certificate-based public key cryptosystems to solve related security issues. But it is based on the condition that the certificate authority (CA) must be honest and needs to manage the key directory. Furthermore, it needs to spend extra time to verify the signature signed in the digital certificate by the CA...
متن کامل